package Algorithm;

import java.util.*;

public class Day08 {
    public static void main1(String[] args) {
        String s = "abcdefg";
        char[] sChar = s.toCharArray();
        int k = 2;
        int left = 0;
        int right = k - 1;

        int remain = 0;
        for(int i = 0; i < s.length(); i += 2*k) {
            remain = s.length() - i;
            if (remain < k) {
                right = s.length() - 1;
                left = i;
                while (left < right) {
                    swap(left, right, sChar);
                    left++;
                    right--;
                }
            } else {
                right = i + k - 1;
                left = i;
                while (left < right) {
                    swap(left, right, sChar);
                    left++;
                    right--;
                }
            }
        }
        s = sChar.toString();
        System.out.println(s);
    }

    public static void swap(int left, int right, char[] c) {
        char t = c[left];
        c[left] = c[right];
        c[right] = t;
    }

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String s = scan.next();
        StringBuffer res = new StringBuffer();
        int start = 0;
        for(int i = 0; i < s.length(); i++) {
            if(s.charAt(i) >= 'a' && s.charAt(i) <= 'z') continue;
            else {
                if(start == 0 || i == s.length()-1) {
                    res.append(s.substring(start, i));
                } else {
                    res.append(s.substring(start+1, i));
                }
                res.append("number");
                start += i;
            }
        }
        System.out.println(res.toString());
    }
}
